A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

正则化方法在非线性分析中的应用

本文用正则化方法给出了麦夸脱方法的一个误差估计式.     

关于(S)_+型映射的一个区域不变定理及其应用

本文运用拓扑度方法,获得一个关于(S)_+型映射的区域不变定理。作为它的应用,本文得到了扩张映射的满值性,从而部分地回答了著名数学家L.Nirenberg提出的一个关于扩张映射满值性的公开问题。     

树形挠性多体系统的 Kane 动力学方程 ——一种面向计算机的建模方法

本文针对具有树形结构的空间挠性多体系统,建立了Kane 动力学模型。挠性多体系统由任意数目的挠性体或刚体组成,假定铰链点之间具有三自由度相对转动和平动,选取相对平动速度和转动角速度,以及模态坐标的导数为系统的广义速度,建立了系统的最小维数运动方程,所得结果便于计算机自动生成和进行数值仿真。     

非线性系统的神经网络广义预测控制

研究了神经网络广义预测控制方法在非线性系统中的应用，基于BP网络构造神经网络预测器，利用非线性系统的开环输入输出数据离线训练神经网络，根据拟牛顿BFGS优化算法使得二次型性能指标函数达到最小，得到了最优的控制序列。同时给出了神经网络广义预测控制算法的步骤，讨论了提高系统鲁棒性的措施。仿真结果表明，这种神经网络预测控制算法具有响应速度快、控制效果好和跟踪精度高等特点。     

有关交簇超图的两个结论

本文结合超图中著名的EKR定理，充分利用补超图这一有力工具，论证了在限定条件下交簇超图的两个结论，从而推广了EKR定理。     

Directional change‐point detection for process control with multivariate categorical data

Most modern processes involve multiple quality characteristics that are all measured on attribute levels, and their overall quality is determined by these characteristics simultaneously. The characteristic factors usually correlate with each other, making multivariate categorical control techniques a must. We study Phase I analysis of multivariate categorical processes (MCPs) to identify the presence of change‐points in the reference dataset. A directional change‐point detection method based on log‐linear models is proposed. The method exploits directional shift information and integrates MCPs into the unified framework of multivariate binomial and multivariate multinomial distributions. A diagnostic scheme for identifying the change‐point location and the shift direction is also suggested. Numerical simulations are conducted to demonstrate the detection effectiveness and the diagnostic accuracy.© 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

二阶非线性常微分方程组边值问题的正解

研究一类二阶常微分方程组两点边值问题,利用Krasnoselskii’s不动点定理,得到当f和g满足超线性或次线性时边值问题一个正解存在的充分条件.     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

舰船舵减横摇广义预测约束控制

依据舵减摇状态空间模型,推导舵减横摇广义预测控制律,在舵角舵速约束的条件下,采用二次型规划计算控制量进行减横摇控制.对某一船舶在典型航行工况下进行了系统仿真,仿真结果表明,该方法不但可取得35%～45%的减摇效果,而且对横摇角速度与横摇角加速度也有40%左右的减小效果.